Reducing Communication in Distributed Asynchronous Iterative Methods
نویسندگان
چکیده
منابع مشابه
Superboundary Exchange: a Technique for Reducing Communication in Distributed Implementations of Iterative Computations
We introduce a technique for lowering the communication cost in a certain type of distributed application, in which processors perform computation in each time step and must obtain boundary data from their neighbors before they can perform the next time step. A typical example of such an application is solving diier-ential equations using the nite diierence method. Our method, which we call Sup...
متن کاملDALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs
Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...
متن کاملSlotted-FIFO Communication for Asynchronous Distributed Systems
Communication protocols designed for database applications are not necessarily suitable for other applications, like multimedia communication, due to the former's requirement of reliable and ordered communication, and the latter's ability to withstand occasional losses and misordering of messages as long as real-time communication can be supported. This paper presents the slotted-FIFO communica...
متن کاملWeights in block iterative methods
In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...
متن کاملOn Adaptive Communication in Asynchronous Real-Time Distributed Systems
We present adaptive communication heuristic algorithms for periodic tasks in asynchronous real-time distributed systems. The heuristic algorithms adapt the application to workload changes through trans-node message-level adaptation mechanisms. We present adaptive communication heuristics for IEEE 802.5 token ring networks that support the prioritydriven protocol and for FDDI networks that use t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2016
ISSN: 1877-0509
DOI: 10.1016/j.procs.2016.05.501